Classes of graphs with small rank decompositions are X-bounded
نویسندگان
چکیده
A class of graphs G is χ-bounded if the chromatic number of graphs in G is bounded by a function of the clique number. We show that if a class G is χ-bounded, then every class of graphs admitting a decomposition along cuts of small rank to graphs from G is χ-bounded. As a corollary, we obtain that every class of graphs with bounded rank-width (or equivalently, clique-width) is χ-bounded.
منابع مشابه
Automata approach to graphs of bounded rank-width
Rank-width is a rather new structural graph measure introduced by Oum and Seymour in 2003 in order to find an efficiently computable approximation of clique-width of a graph. Being a very nice graph measure indeed, the only serious drawback of rank-width was that it is virtually impossible to use a given rank-decomposition of a graph for running dynamic algorithms on it. We propose a new indepe...
متن کاملGrad and classes with bounded expansion I. Decompositions
We introduce classes of graphs with bounded expansion as a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, the greatest reduced average density (grad) of G with rank r, ∇r(G). For these classes we prove the existence of several partition results such as the existence of low tree-width and low tree-depth colorings. This ge...
متن کاملk-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملComputing Bounded Path Decompositions in Logspace
The complexity of Graph Isomorphism (GI) is a long-standing open problem. GI is not known to be solvable in polynomial time and is unlikely to be NP-complete [BHZ87, Sch88]. Polynomial-time algorithms are known for GI of several special classes of graphs. One such interesting class is graphs excluding a fixed minor. Any family of graphs that is closed under taking minors falls into this class. ...
متن کاملRank-width and Well-quasi-ordering of Skew-Symmetric or Symmetric Matrices (extended abstract)
We prove that every infinite sequence of skew-symmetric or symmetric matrices M1, M2, . . . over a fixed finite field must have a pair Mi, Mj (i < j) such that Mi is isomorphic to a principal submatrix of the Schur complement of a nonsingular principal submatrix in Mj , if those matrices have bounded rank-width. This generalizes three theorems on well-quasi-ordering of graphs or matroids admitt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Eur. J. Comb.
دوره 33 شماره
صفحات -
تاریخ انتشار 2012